Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters, the matrix is positive definite (or positive semidefinite). We state a characterization in the form of equivalent conditions, and also propose some computationally cheap sufficient\,/\,necessary conditions. Our results extend the classical results on positive (semi-)definiteness of interval matrices. They may be useful for checking convexity or non-convexity in global optimization methods based on branch and bound framework and using interval techniques

Minimal renormalization without \epsilon-expansion: Three-loop amplitude functions of the O(n) symmetric \phi^4 model in three dimensions below T_c

We present an analytic three-loop calculation for thermodynamic quantities of the O(n) symmetric \phi^4 theory below T_c within the minimal subtraction scheme at fixed dimension d=3. Goldstone singularities arising at an intermediate stage in the calculation of O(n) symmetric quantities cancel among themselves leaving a finite result in the limit of zero external field. From the free energy we calculate the three-loop terms of the amplitude functions f_phi, F+ and F- of the order parameter and the specific heat above and below T_c, respectively, without using the \epsilon=4-d expansion. A Borel resummation for the case n=2 yields resummed amplitude functions f_phi and F- that are slightly larger than the one-loop results. Accurate knowledge of these functions is needed for testing the renormalization-group prediction of critical-point universality along the \lambda-line of superfluid He(4). Combining the three-loop result for F- with a recent five-loop calculation of the additive renormalization constant of the specific heat yields excellent agreement between the calculated and measured universal amplitude ratio A+/A- of the specific heat of He(4). In addition we use our result for f_phi to calculate the universal combination R_C of the amplitudes of the order parameter, the susceptibility and the specific heat for n=2 and n=3. Our Borel-resummed three-loop result for R_C is significantly more accurate than the previous result obtained from the \epsilon-expansion up to O(\epsilon^2).Comment: 29 pages LaTeX including 3 PostScript figures, to appear in Nucl. Phys. B [FS] (1998

Five-loop additive renormalization in the phi^4 theory and amplitude functions of the minimally renormalized specific heat in three dimensions

We present an analytic five-loop calculation for the additive renormalization constant A(u,epsilon) and the associated renormalization-group function B(u) of the specific heat of the O(n) symmetric phi^4 theory within the minimal subtraction scheme. We show that this calculation does not require new five-loop integrations but can be performed on the basis of the previous five-loop calculation of the four-point vertex function combined with an appropriate identification of symmetry factors of vacuum diagrams. We also determine the amplitude functions of the specific heat in three dimensions for n=1,2,3 above T_c and for n=1 below T_c up to five-loop order. Accurate results are obtained from Borel resummations of B(u) for n=1,2,3 and of the amplitude functions for n=1. Previous conjectures regarding the smallness of the resummed higher-order contributions are confirmed. Borel resummed universal amplitude ratios A^+/A^- and a_c^+/a_c^- are calculated for n=1.Comment: 30 pages REVTeX, 3 PostScript figures, submitted to Phys. Rev.

Inverse bifurcation analysis: application to simple gene systems

BACKGROUND: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional forward problem of determining the mapping from parameter space to the space of model behavior, the inverse problem of determining model parameters to result in certain desired properties of the bifurcation diagram provides an attractive methodology for addressing important biological problems. These include understanding how the robustness of qualitative behavior arises from system design as well as providing a way to engineer biological networks with qualitative properties. RESULTS: We demonstrate that certain inverse bifurcation problems of biological interest may be cast as optimization problems involving minimal distances of reference parameter sets to bifurcation manifolds. This formulation allows for an iterative solution procedure based on performing a sequence of eigen-system computations and one-parameter continuations of solutions, the latter being a standard capability in existing numerical bifurcation software. As applications of the proposed method, we show that the problem of maximizing regions of a given qualitative behavior as well as the reverse engineering of bistable gene switches can be modelled and efficiently solved

Mining protein loops using a structural alphabet and statistical exceptionality

<p>Abstract</p> <p>Background</p> <p>Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied.</p> <p>Results</p> <p>We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times). Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words). These structural words have low structural variability (mean RMSd of 0.85 Å). As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues) and long loops. Moreover, half of recurrent motifs exhibit a significant level of amino-acid conservation with at least four significant positions and 87% of long loops contain at least one such word. We complement our analysis with the detection of statistically over-represented patterns of structural letters as in conventional DNA sequence analysis. About 30% (930) of structural words are over-represented, and cover about 40% of loop lengths. Interestingly, these words exhibit lower structural variability and higher sequential specificity, suggesting structural or functional constraints.</p> <p>Conclusions</p> <p>We developed a method to systematically decompose and study protein loops using recurrent structural motifs. This method is based on the structural alphabet HMM-SA and not on structural alignment and geometrical parameters. We extracted meaningful structural motifs that are found in both short and long loops. To our knowledge, it is the first time that pattern mining helps to increase the signal-to-noise ratio in protein loops. This finding helps to better describe protein loops and might permit to decrease the complexity of long-loop analysis. Detailed results are available at <url>http://www.mti.univ-paris-diderot.fr/publication/supplementary/2009/ACCLoop/</url>.</p

Constraint removal in linear MPC: An improved criterion and complexity analysis

Constraint removal accelerates model predictive control by detecting inactive constraints at the yet unknown optimal solution and removing them from the online optimization problem. We show in this paper that the number of removed constraints can be increased further by generalizing previously used inactivity criteria. The proposed generalization does not depend on information available at previous time steps, and consequently can also be applied at the initial state. In addition, we provide a detailed analysis of the computational complexity of the proposed variant and of existing constraint removal methods, applied to both active-set (AS) and interior-point (IP) solvers. Finally, we compare the different constraint removal variants in numerical experiments to corroborate the complexity analysis carried out, showing the greatest benefits of the proposed variant, especially with IP solvers

Инвестиционные ресурсы банковской системы Китая

Цель работы – выявить источники и особенности инвестиционных ресурсов, которые использует банковская система КНР для стимулирования экономического роста в стране. Объект исследования: банковская система КНР. Предмет исследования – инвестиционная деятельность банковской системы КНР. Работа состоит из введения, трех глав, заключения, списка литературы, приложений. Для подготовки работы использованы научная литература и данные из открытых источников (статистические агентства КНР).The aim of the study is to identify the sources and characteristics of investment resources, which are used by the Chinese banks to stimulate economic growth in China. Object: Bank system of China. Subject is investment in China's bank system. The manuscript consists of an introduction, three chapters, conclusion, list of references, appendix. Scientific literature and data from open sources (National statistical agency of China) were used to prepare the manuscript